Fibonacci numbers

Fibonacci numbers is sequence of numbers, in which every term is the sum of its two predecessors. Start with 1, 1, every time after that is sum of there two predecessors.

• 1, 1, 2, 3, 5, 8, 13.....

for example: the fith term of fibonacci number is 5
code for fibonacci numbers:

public int fibonacci(int n)
{
    if (n <= 2)
    return 1;
    else
    return fibonacci(n-1) + fibonacci(n-2);
}